Uriel Feige

Results: 50



#Item
41Computing / Information / Data / Network performance / Throughput / Transmission Control Protocol

Buffer Management for Colored Packets with Deadlines∗ Yossi Azar† Uriel Feige‡ Iftah Gamzu§

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2009-06-09 04:58:28
42Analysis of algorithms / SL / Randomized algorithm / Connectivity / NP-complete problems / Graph coloring / Theoretical computer science / Computational complexity theory / Applied mathematics

arXiv:0909.2005v1 [cs.DS] 10 SepDeterministic approximation for the cover time of trees Uriel Feige∗

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2009-09-10 14:01:15
43Uriel Feige / NP-complete problems / Computational complexity theory / Adi Shamir / Symposium on Theory of Computing / International Colloquium on Automata /  Languages and Programming / Symposium on Foundations of Computer Science / Approximation algorithm / Uriel / Theoretical computer science / Applied mathematics / Mathematics

Uriel Feige, Publications, JanuaryPapers are sorted by categories. For papers that have more than one version (typically, journal version and conference proceedings), the different versions are combined into one

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2015-01-02 09:14:39
44Gaming / Nash equilibrium / Solution concept / Trembling hand perfect equilibrium / Strategy / Outcome / Subgame perfect equilibrium / Best response / Zero–sum game / Game theory / Problem solving / Decision theory

Algorithms for Computing Solution Concepts in Game Theory Uriel Feige December 21, 2008 Preface These are notes for the first five lectures of the course on Algorithmic Game Theory, given (starting

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2008-12-21 05:44:40
45Ethology / Economic model / Utility / Scientific theory / Falsifiability / Game theory / Karl Popper / Economics / Science / Philosophy of science / Knowledge

On the diversity principle and local falsifiability Uriel Feige October 22, 2012 1

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2012-10-22 06:49:06
46Computational complexity theory / Complexity classes / Approximation algorithm / NP-complete / ACM SIGACT / European Symposium on Algorithms / International Colloquium on Automata /  Languages and Programming / Uriel Feige / Algorithm / Theoretical computer science / Applied mathematics / Computer science

Curriculum Vitae of Uriel Feige Contact Information Department of Computer Science and Applied Mathematics The Weizmann Institute of Science Rehovot 76100, ISRAEL Phones (office), (cell)

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2015-01-01 11:38:31
47Cryptographic protocols / Probabilistic complexity theory / Complexity classes / Zero-knowledge proof / Structural complexity theory / Proof of knowledge / Interactive proof system / Non-interactive zero-knowledge proof / IP / Theoretical computer science / Computational complexity theory / Cryptography

Witness Indistinguishable and Witness Hiding Protocols Uriel Feige, Adi Shamir Department of Applied Mathematics The Weizmann Institute of Science Rehovot 76100, Israel

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2004-04-12 23:16:13
48NP-complete problems / Graph coloring / Clique / Graph operations / Independent set / Clique problem / Line graph / Graph theory / Theoretical computer science / Mathematics

Derandomized Graph Products Noga Alon ∗ Uriel Feige†

Add to Reading List

Source URL: www.tau.ac.il

Language: English - Date: 2002-02-21 20:23:30
49Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm / IP / Random walk / Markov chain / Quantum Byzantine agreement / Statistics / Theoretical computer science / Probability theory

Noncryptographic Selection Protocols (Extended Abstract) Uriel Feige

Add to Reading List

Source URL: www.disco.ethz.ch

Language: English - Date: 2011-01-19 07:00:55
50Complexity classes / Probabilistic complexity theory / Mathematical optimization / Mathematical proofs / Interactive proof system / NP / Probabilistically checkable proof / P versus NP problem / MAX-3SAT / Theoretical computer science / Computational complexity theory / Applied mathematics

Interactive Proofs and the Hardness of Approximating Cliques Uriel Feige ∗

Add to Reading List

Source URL: web.cs.elte.hu

Language: English - Date: 2007-01-10 14:31:22
UPDATE